Path optimization for graph partitioning problems
نویسندگان
چکیده
منابع مشابه
Path Optimization for Graph Partitioning Problems
This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very well-known algorithms for partitioning: the Kernighan-Lin algorithm and simulated annealing. Our experiments are described in detail, and the results are presented in such a way as to reveal performance trends b...
متن کاملExtremal Optimization for Graph Partitioning
Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the computationally hard (NP-hard) graph partitioning problem. We discuss the scaling behavior of extremal optimization, focusing on the convergence of the average run as a function of run time and system size. The method has a single free para...
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Graph Partitioning Problems 18.1 Graph Partitioning Problems 18.1.2 Multiway Cut
This lecture gives a general introduction of graph partitioning problems. We will begin with the definitions of some classic graph partitioning problems (e.g. multiway cut, multicut, sparsest cut), and discuss their relationships. Then we will focus on deriving two approximation algorithms. For the multiway cut problem, we will show a 2-approximation algorithm through a combinatorial argument. ...
متن کاملPartitioning Problems for Distributed Optimization
The Alternating Directions Method of Multipliers (ADMM) ([BPC+11]) paradigm for distributed optimization assumes that the objective of an optimization problem splits into two additive components which are separately easy to optimize. Here, I generalize the ADMM paradigm to problems with an arbitrary number of additive components in the objective, and ask the question: how can we partition the o...
متن کاملApproximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that each color class is totally partitioned. Equivalently, given a weighted complete k-partite graph, cover its vertices with a minimum number of disjoint cliques in such a way that the total weight of the cliques is maximize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00084-5